Acceptable Programs Revisited

Acceptable Programs Revisited

Acceptable logic programs have been studied extensively in the context of proving termination of Prolog programs. It is diicult, however, to establish acceptability from the deenition since this depends on nding a suitable model, which need not be a Herbrand model in general, together with a suitable level mapping that one can use to check the conditions which characterize acceptability. In thi...

Unification-free Prolog programs revisited

Datalog Programs over Infinite Databases, Revisited

Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, the interest in infinite databases has been sparked by additional scenarios, e.g., as a formal model of a database of an openworld software or of other relations that may be spread across the Web. This paper revisits the...

Bounded Model Checking of Pointer Programs Revisited

Bounded model checking of pointer programs is a debugging technique for programs that manipulate dynamically allocated pointer structures on the heap. It is based on the following four observations. First, error conditions like dereference of a dangling pointer, are expressible in a fragment of first-order logic with two-variables. Second, the fragment is closed under weakest preconditions wrt....

Specification of Parametrized Programs - Persistency Revisited

The important distinction between parameterized specifications and specifications of parameterized programs has been originally pointed out in [12]. An important difference concerns the objects which the two kinds of parameterization allow one to reuse. A parameterized specification, “PSP”, e.g., of stacks parameterized by elements, Stack(El), allows one, under some conditions, to instantiate t...